#pragma once
#include<vector>
namespace tmt
{
	template<class T>
	class less
	{
	public:
		bool operator()(const T& l, const T& r) const
		{
			return l < r;
		}
	};

	template<class T>
	class greater
	{
	public:
		bool operator()(const T& l, const T& r) const
		{
			return l > r;
		}
	};

	template<class T,class Container = vector<T>,class Compare = less<T>>
	class priority_queue
	{
	public:
		priority_queue()
		{}
		template<class InputIterator>
		priority_queue(InputIterator start, InputIterator end)
		{
			while (start != end)
			{
				_con.push_back(*start);
				start++;
			}

			for (int i = (_con.size() - 1 - 1) / 2; i >= 0; i--)
			{
				adjust_down(i);
			}
		}
		void adjust_up(size_t child)
		{
			Compare com;
			size_t parent = (child - 1) / 2;

			while (child > 0)
			{
				//if (com(_con[parent], _con[child]))
				//{
				//	std::swap(_con[child], _con[parent]);
				//	child = parent;
				//	parent = (parent - 1) / 2;
				//}

				if (com(_con[parent], _con[child]))
				{
					std::swap(_con[parent], _con[child]);

					/*std::swap(_con[child], _con[parent]);*/

					child = parent;
					parent = (child - 1) / 2;
				}


				else
				{
					break;
				}
			}
		}

		//// logN
		//void adjust_up(size_t child)
		//{
		//	Compare com;
		//	size_t parent = (child - 1) / 2;
		//	while (child > 0)
		//	{
		//		//if (_con[child] > _con[parent])
		//		//if (_con[parent] < _con[child])
		//		if (com(_con[parent], _con[child]))
		//		{
		//			std::swap(_con[child], _con[parent]);
		//			child = parent;
		//			parent = (child - 1) / 2;
		//		}
		//		else
		//		{
		//			break;
		//		}
		//	}
		//}
		void adjust_down(size_t parent)
		{
			Compare com;
			size_t child = parent * 2 + 1;
			while (child < _con.size())
			{
				if (child + 1 < _con.size() && com(_con[child], _con[child + 1]))
				{
					child++;
				}
				if (com(_con[parent], _con[child]))
				{
					std::swap(_con[parent], _con[child]);
					parent = child;
					child = child * 2 + 1;
				}
				else
				{
					break;
				}
			}
		}
		void push(const T& x)
		{
			_con.push_back(x);
			adjust_up(_con.size() - 1);
		}
		void pop()
		{
			std::swap(_con.front(), _con.back());
			_con.pop_back();
			adjust_down(0);
		}
		bool empty()  const
		{
			return _con.empty();
		}

		size_t size() const
		{
			return _con.size();
		}
		const T& top() const
		{
			return _con[0];
		}
		//const T& top() cosnt
		//{
		//	return _con.front;
		//}
	private:
		Container _con;
	};
}